منابع مشابه
Types for Deadlock-Free Higher-Order Concurrent Programs
Deadlock freedom is for concurrent programs what progress is for sequential ones: it indicates the absence of stable (i.e., irreducible) states in which some pending operations cannot be completed. In the particular case of communicating processes, operations are inputs and outputs on channels and deadlocks may be caused by mutual dependencies between communications. In this work we define an e...
متن کاملGeneralizations of Product-Free Subsets
In this paper, we present some generalizations of Gowers’s result about product-free subsets of groups. For any group G of order n, a subset A of G is said to be product-free if there is no solution of the equation ab = c with a, b, c ∈ A. Previous results showed that the size of any product-free subset of G is at most n/δ1/3, where δ is the smallest dimension of a nontrivial representation of ...
متن کاملOrder on Order Types
Given P and P ′, equally sized planar point sets in general position, we call a bijection from P to P ′ crossing-preserving if crossings of connecting segments in P are preserved in P ′ (extra crossings may occur in P ′). If such a mapping exists, we say that P ′ crossing-dominates P , and if such a mapping exists in both directions, P and P ′ are called crossing-equivalent. The relation is tra...
متن کاملLimits of Order Types
The notion of limits of dense graphs was invented, among other reasons, to attack problems in extremal graph theory. It is straightforward to define limits of order types in analogy with limits of graphs, and this paper examines how to adapt to this setting two approaches developed to study limits of dense graphs. We first consider flag algebras, which were used to open various questions on gra...
متن کاملGeneralized Sum - Free Subsets 751
Let F {A(1): < i < t, t 2}, be a finite collection of finite, palrwlse disjoint subsets of Z+. Let SC R\{0} and A Z+ be finite sets. Denote by S A {i=isi:a A, i S, the s i are not ncesarily dlstinct }. For S and F as above we say that S is F-free if for every A(i), A(J) F, i J, SA(1)(% SA(j) . We prove that for S and F as above, S contains an F-free subset Q such that This result generalizes ea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1997
ISSN: 0168-0072
DOI: 10.1016/s0168-0072(96)00016-4